Character degree graphs with no complete vertices
نویسندگان
چکیده
منابع مشابه
Character Degree Graphs That Are Complete Graphs
Let G be a finite group, and write cd(G) for the set of degrees of irreducible characters of G. We define Γ(G) to be the graph whose vertex set is cd(G) − {1}, and there is an edge between a and b if (a, b) > 1. We prove that if Γ(G) is a complete graph, then G is a solvable group.
متن کاملOn Graphs with Adjacent Vertices of Large Degree
Let g(n, m) denote the class of simple graphs on n vertices and m edges and let C E 9( a, m). For suitably restricted values of m, C will necessarily contain certain prescribed subgraphs such as cycles of given lengths and complete graphs . For example> if m > 7nZ then G contains cycles of all lengths up to Li(n+ 3) J . Recently we have established a number of results concerning the existence o...
متن کاملDomination dot-critical graphs with no critical vertices
A graph G is dot-critical if contracting any edge decreases the domination number. It is totally dot-critical if identifying any two vertices decreases the domination number. Burton and Sumner [Discrete Math. 306 (2006) 11–18] posed the problem: Is it true that for k 4, there exists a totally k-dot-critical graph with no critical vertices? In this paper, we show that this problem has a positive...
متن کاملGraphs with no M-alternating path between two vertices
Let G be a graph with a perfect matching M . In this paper, we prove two theorems to characterize the graph G in which there is no M -alternating path between two vertices x and y in G. c © 2003 Elsevier B.V. All rights reserved.
متن کاملComplete Bipartite Graphs with No Rainbow Paths
Motivated by questions in Ramsey theory, Thomason and Wagner described the edge colorings of complete graphs that contain no rainbow path Pt of order t. In this paper, we consider the edge colorings of complete bipartite graphs that contain no rainbow path Pt. Mathematics Subject Classification: 05C15, 05C38, 05C55
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2012
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2011.11.029